import sys
input=sys.stdin.readline
def comding():
a,b,c=tup()
while(b%3 and c>0):
b+=1
c-=1
if (b%3):print(-1)
else:
if c%3==0: print(a+(b//3)+(c//3))
else:
print((a+(b+c)//3)+1)
return
def i(): return input()
def ii(): return int(input())
def tup(): return map(int,input().split())
def ls(): return [x for x in input().split()]
def ils(): return [int(x) for x in input().split()]
def sils(): return sorted([int(x) for x in input().split()])
for __ in range(ii()): comding()
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |